Solving CSP Instances Beyond the Phase Transition Using Stochastic Search Algorithms
نویسندگان
چکیده
When solving constraint satisfaction problems (CSPs) with stochastic search algorithms (SSAs) using the standard penalty function, it is not possible to show that there is no solution for a problem instance. In this paper we present a hybrid function that can be generally used in conjunction with SSAs to prove unsolvability without changing the search algorithms drastically. We use eight state-of-the-art algorithms to show the general usability of the new function. We compare the algorithms with and without the new penalty function and we test the scalability of the new function.
منابع مشابه
Unweighted Stochastic Local Search can be Effective for Random CSP Benchmarks
We present ULSA, a novel stochastic local search algorithm for random binary constraint satisfaction problems (CSP). ULSA is many times faster than the prior state of the art on a widely-studied suite of random CSP benchmarks. Unlike the best previous methods for these benchmarks, ULSA is a simple unweighted method that does not require dynamic adaptation of weights or penalties. ULSA obtains n...
متن کاملMachine Learning in the Phase Transition Framework
We investigate k-term DNF learning, the task of inducing a propositional DNF formula with at most k terms from a set of positive and negative examples. Though k-term DNF learning is NP-complete, it is at the core of most propositional learning algorithms. The main aim of this thesis is to evaluate stochastic local search algorithms to solve hard k-term DNF learning tasks. As a reference we firs...
متن کاملSolving a Stochastic Cellular Manufacturing Model by Using Genetic Algorithms
This paper presents a mathematical model for designing cellular manufacturing systems (CMSs) solved by genetic algorithms. This model assumes a dynamic production, a stochastic demand, routing flexibility, and machine flexibility. CMS is an application of group technology (GT) for clustering parts and machines by means of their operational and / or apparent form similarity in different aspects ...
متن کاملHiding solutions in random satisfiability problems: A statistical mechanics approach
A major problem in evaluating stochastic local search algorithms for NP-complete problems is the need for a systematic generation of hard test instances having previously known properties of the optimal solutions. On the basis of statistical mechanics results, we propose random generators of hard and satisfiable instances for the 3-satisfiability problem. The design of the hardest problem insta...
متن کاملScoring Functions Based on Second Level Score for k-SAT with Long Clauses
It is widely acknowledged that stochastic local search (SLS) algorithms can efficiently find models for satisfiable instances of the satisfiability (SAT) problem, especially for random k-SAT instances. However, compared to random 3-SAT instances where SLS algorithms have shown great success, random k-SAT instances with long clauses remain very difficult. Recently, the notion of second level sco...
متن کامل